Row-ordering schemes for sparse givens transformations. II. implicit graph model
نویسندگان
چکیده
منابع مشابه
Generic Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical framework, for reasons of performance the corresponding implementations are typically realized with programming languages devoid of language features necessary to explicitly represent graph abstractions. Recently, generic ...
متن کاملIntegrators Based on Householder and Givens Transformations
We carry further our work [DV2] on orthonormal integrators based on Householder and Givens transformations. We propose new algorithms and pay particular attention to appropriate implementation of these techniques. We also present a suite of Fortran codes and provide numerical testing to show the efficiency and accuracy of our techniques. AMS(MOS) subject classifications. Primary 65L
متن کاملWhat Algebraic Graph Transformations Can Do For Model Transformations
Model transformations are key activities in model-driven development (MDD). A number of model transformation approaches have emerged for different purposes and with different backgrounds. This paper focusses on the use of algebraic graph transformation concepts to specify and verify model transformations in MDD.
متن کاملA Locality Preserving Graph Ordering Approach for Implicit Partitioning: Graph-Filing Curves
Linear orderings defined through space-filling curves are often applied to quickly partition graphs arising in finite element simulations. In applications with constant meshes but a rapidly changing load per element, an ordering has to be determined only once and all subsequent partitionings can be computed very quickly through a simple interval splitting. However, partitionings based on space-...
متن کاملGraph Transformations for Model-based Testing
Model-based development uses modeling and simulation as essential means for specification, rapid prototyping, design, and realization of embedded systems. The classification-tree method complements model-based development with a formal approach for test case description and automation. This paper shows how “raw” classification trees are transformed into complete classification trees using an ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1986
ISSN: 0024-3795
DOI: 10.1016/0024-3795(86)90190-4